Simple Gallager Codes for Bsc

نویسندگان

  • Yoshiyuki Kabashima
  • David Saad
چکیده

We investigate the performance of Gallager type error-correcting codes for Binary Symmetric Channels, where the code word comprises products of K bits selected from the original message and decoding is carried out utilizing a connectivity tensor with C connections per index. Shannon's bound for the channel capacity is recovered for large K and zero temperature when the code rate K=C is nite. Close to optimal error-correcting capability, with improved decoding properties is obtained for nite K and C.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decoding Codes on Graphs

Iterat ive decoding is a widely used technique in modern communications systems. The Low Density Parity Check (LDPC) codes of Gallager were the earliest codes for which iterat ive decoding techniques were dēned. These codes along with a simple iterat ive decoding algorithm were int roduced in the r̄st part of this art icle. Here we describe a probabilist ic iterat ive decoding scheme, also propo...

متن کامل

Gallager Codes for CDMA Applications—Part II: Implementations, Complexity, and System Capacity

We focus our attention on Gallager codes with parameters compatible with the IS-95 cellular radio standard. We discuss low complexity software and hardware implementations of an iterative decoder for fN; ; 3g Gallager codes. We estimate that by using Gallager codes, a factor of five improvement in the code-division multiple-access system capacity relative to an uncoded system can be achieved, e...

متن کامل

Gallager codes for CDMA applications. II. Implementations, complexity, and system capacity

We focus our attention on Gallager codes with parameters compatible with the IS-95 cellular radio standard. We discuss low complexity software and hardware implementations of an iterative decoder for fN; ; 3g Gallager codes. We estimate that by using Gallager codes, a factor of five improvement in the code-division multiple-access system capacity relative to an uncoded system can be achieved, e...

متن کامل

Gallager Codes – Recent Results

In 1948, Claude Shannon posed and solved one of the fundamental problems of information theory. The question was whether it is possible to communicate reliably over noisy channels, and, if so, at what rate. He defined a theoretical limit, now known as the Shannon limit, up to which communication is possible, and beyond which communication is not possible. Since 1948, coding theorists have attem...

متن کامل

Gallager Codes for High Rate Applications

Gallager codes with large block length and low rate (e.g., N ' 10, 000–40, 000, R ' 0.25–0.5) have been shown to have recordbreaking performance for low signal-to-noise applications. Gallager codes with high rates (R ' 0.8–0.94) are also excellent, outperforming comparable BCH and Reed-Solomon codes, even at short blocklength (N ' 2, 000–4, 000) (MacKay and Davey, 2000). This paper looks in mor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007